- Ramsey theorem
- теорема f Рамсея
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
Ramsey's theorem — This article goes into technical details quite quickly. For a slightly gentler introduction see Ramsey theory. In combinatorics, Ramsey s theorem states that in any colouring of the edges of a sufficiently large complete graph (that is, a simple… … Wikipedia
Ramsey theory — This article provides an introduction. For a more detailed and technical article, see Ramsey s theorem. Ramsey theory, named for Frank P. Ramsey, is a branch of mathematics that studies the conditions under which order must appear. Problems in… … Wikipedia
Theorem on friends and strangers — All the 78 possible friends strangers graphs with 6 nodes. For each graph the red/blue nodesshows a sample triplet of mutual friends/strangers.The friendship theorem is a mathematical theorem in an area of mathematics called Ramsey… … Wikipedia
Paris–Harrington theorem — In mathematical logic, the Paris–Harrington theorem states that a certain combinatorial principle in Ramsey theory is true, but not provable in Peano arithmetic. This was the first natural example of a true statement about the integers that could … Wikipedia
Milliken's tree theorem — In mathematics, Milliken s tree theorem in combinatorics is a partition theorem generalizing Ramsey s theorem to infinite trees, objects with more structure than sets. Let T be a finitely splitting rooted tree of height ω, n a positive integer,… … Wikipedia
Frank P. Ramsey — Frank Plumpton Ramsey (* 22. Februar 1903 in Cambridge; † 19. Januar 1930) war ein britischer Mathematiker und Logiker. Inhaltsverzeichnis 1 Leben und Wirken 2 Werke (Auswahl) 3 Literatur … Deutsch Wikipedia
Frank Plumpton Ramsey — (* 22. Februar 1903 in Cambridge; † 19. Januar 1930) war ein britischer Mathematiker und Logiker. Inhaltsverzeichnis 1 Leben und Wirken 2 Werke (Auswahl) 3 Literatur … Deutsch Wikipedia
Halpern-Lauchli theorem — In mathematics, the Halpern Läuchli theorem is a partition result about finite products of infinite trees. Its original purpose was to give a model for set theory in which the Boolean prime ideal theorem is true but the axiom of choice is false.… … Wikipedia
Frank P. Ramsey — Infobox Philosopher region = United Kingdom era = 20th century color = #B0C4DE image size = 200px image caption = name = Frank P. Ramsey birth = 22 February 1903 death = 19 January 1930 school tradition = Analytic philosophy main interests =… … Wikipedia
Théorie de Ramsey — La théorie de Ramsey, qui porte le nom de Frank Ramsey, pose typiquement une question de la forme : combien d éléments d une certaine structure doivent être considérés pour qu une propriété particulière se vérifie ? Un adage souvent… … Wikipédia en Français
Van der Waerden's theorem — is a theorem of the branch of mathematics called Ramsey theory. The theorem is about the basic structure of the integers. It is named for Dutch mathematician B. L. van der Waerden. [B.L. van der Waerden, Beweis einer Baudetschen Vermutung , Nieuw … Wikipedia